A Comprehensive Study of Power - E ffi cient Rendezvous Schemes for Wireless Sensor Networks

نویسندگان

  • En-Yi Lin
  • Jan Rabaey
  • Paul Wright
چکیده

A Comprehensive Study of Power-Efficient Rendezvous Schemes for Wireless Sensor Networks by En-Yi Lin Doctor of Philosophy in Department of Electrical Engineering and Computer Sciences University of California, Berkeley Professor Jan Rabaey, Chair Recently, advances in integrated circuit technology enabled the realization of wireless sensor networks. Wireless sensor nodes are characterized by their limited power resources. Given typical sensor network traffic loads, one of the most effective ways to minimize power consumption is to power off nodes as much as possible. With this approach, it is necessary to arrange simultaneous on-time for nodes to communicate, a method referred to as a rendezvous scheme. This research proposes and analyzes three major categories of rendezvous schemes, and compares their performances. The chosen performance evaluation metrics include both power efficiency and latency, which are the two most important factors in wireless sensor networks. The rendezvous schemes are compared against one another in different network scenarios, namely, different traffic loads, data packet sizes, network densities, channel fading conditions, and with different transceivers. The results identify different network environment as the most appropriate scenario for different categories of schemes to operate in. In short, this research incorporates the physical layer and upper layer influences on rendezvous schemes to provide a general guideline on which rendezvous scheme to select for different sensor network scenarios.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Congestion Control Approaches Applied to Wireless Sensor Networks: A Survey

Wireless Sensor Networks (WSNs) are a specific category of wireless ad-hoc networks where their performance is highly affected by application, life time, storage capacity, processing power, topology changes, the communication medium and bandwidth. These limitations necessitate an effective data transport control in WSNs considering quality of service, energy efficiency, and congestion control. ...

متن کامل

LPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring

Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...

متن کامل

A Priority-based Routing Algorithm for Underwater Wireless Sensor Networks (UWSNs)

Advances in low-power electronics design and wireless communication have enabled the development of low cost, low power micro-sensor nodes. These sensor nodes are capable of sensing, processing and forwarding which have many applications such as underwater networks. In underwater wireless sensor networks (UWSNs) applications, sensors which are placed in underwater environments and predicted ena...

متن کامل

A Novel Comprehensive Taxonomy of Intelligent-Based Routing Protocols in Wireless Sensor Networks

Routing in ad-hoc networks, specifically intelligent-based ones, is a highly interested research topic in recent years. Most of them are simulation-based study. Large percentages have not even mentioned some of the fundamental parameters. This strictly reduces their validity and reliability. On the other hand, there is not a comprehensive framework to classify routing algorithms in wireless sen...

متن کامل

Mathematical Analysis of Optimal Tracking Interval Management for Power Efficient Target Tracking Wireless Sensor Networks

In this paper, we study the problem of power efficient tracking interval management for distributed target tracking wireless sensor networks (WSNs). We first analyze the performance of a distributed target tracking network with one moving object, using a quantitative mathematical analysis. We show that previously proposed algorithms are efficient only for constant average velocity objects howev...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005